Matheuristics - Hybridizing Metaheuristics and Mathematical Programming
نویسنده
چکیده
منابع مشابه
Matheuristics for the capacitated p-median problem
The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...
متن کاملIntegrating matheuristics and metaheuristics for timetabling
The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for hi...
متن کاملNew Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
In this paper we propose new hybrid methods for solving the multidimensional knapsack problem. They can be viewed as matheuristics that combine mathematical programming with the variable neighbourhood decomposition search heuristic. In each iteration a relaxation of the problem is solved to guide the generation of the neighbourhoods. Then the problem is enriched with a pseudo-cut to produce a s...
متن کاملTowards a Matheuristic Approach for the Berth Allocation Problem
The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programmi...
متن کاملMetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
This chapter reviews approaches where metaheuristics are used to boost the performance of exact integer linear programming (IP) techniques. Most exact optimization methods for solving hard combinatorial problems rely at some point on tree search. Applying more effective metaheuristics for obtaining better heuristic solutions and thus tighter bounds in order to prune the search tree in stronger ...
متن کامل